Color puzzles.

نویسندگان

  • D Hubel
  • M Livingstone
چکیده

service Email alerting click here the box at the top right corner of the article or Receive free email alerts when new articles cite this article-sign up in

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated generation and visualization of picture-logic puzzles

A picture-logic puzzle is a game that takes the form of an N M grid, with numbers situated on the left of its rows and on the top of its columns, which give the clues for solving the puzzle. These puzzles have gained popularity in the last years all over the world, and there are companies involved in the commercialization of products related to them, mainly magazines, on-line puzzles via the we...

متن کامل

The Three-hat Problem

Many classical puzzles involve hats. The general setting for these puzzles is a game in which several players are each given a hat to wear. Associated with each hat is either a color or a number. Every player can see the color or number of everyone else’s hat but not his own. The players are then trying to figure out the colors or the numbers on their own hats. The Three-Hat Problem is one of s...

متن کامل

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard

Jigsaw puzzles [9] and edge-matching puzzles [5] are two ancient types of puzzle, going back to the 1760s and 1890s, respectively. Jigsaw puzzles involve fitting together a given set of pieces (usually via translation and rotation) into a desired shape (usually a rectangle), often revealing a known image or pattern. The pieces are typically squares with a pocket cut out of or a tab attached to ...

متن کامل

An Innovative Algorithm for Solving Jigsaw Puzzles Using Geometrical and Color Features

The proposed technique deals with jigsaw puzzles and takes advantage of both geometrical and color features. It is considered that an image is being divided into pieces. The shape of these pieces is not predefined, yet the background’s color is. The whole method concerns a recurrent algorithm, which initially, finds the most important corner points around the contour of a piece, afterwards perf...

متن کامل

Edge-Matching Problems with Rotations

Edge-matching problems, also called edge matching puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II puzzle, and new complexity results. In this paper we consider a number of settings which ...

متن کامل

Edge-Matching and Jigsaw Puzzles are Really Hard

We prove the computational intractability of rotating and placing n square tiles into a 1 × n array such that adjacent tiles are compatible—either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NPhard even to approximately maximize the number of placed tiles (allowing blanks), while satisfying th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Cold Spring Harbor symposia on quantitative biology

دوره 55  شماره 

صفحات  -

تاریخ انتشار 1990